Rules with parameters in modal logic I
نویسندگان
چکیده
منابع مشابه
Rules with parameters in modal logic I
We study admissibility of inference rules and unification with parameters in transitive modal logics (extensions of K4), in particular we generalize various results on parameterfree admissibility and unification to the setting with parameters. Specifically, we give a characterization of projective formulas generalizing Ghilardi’s characterization in the parameter-free case, leading to new proof...
متن کاملDerivation Rules as Anti-Axioms in Modal Logic
We discuss a ‘negative’ way of defining frame classes in (multi-)modal logic, and address the question whether these classes can be axiomatized by derivation rules, the ‘non-ξ rules’, styled after Gabbay’s Irreflexivity Rule. The main result of this paper is a meta-theorem on completeness, of the following kind: If Λ is a derivation system having a set of axioms that are special Sahlqvist formu...
متن کاملModal Deduction in Second-Order Logic and Set Theory - I
In this paper, we generalize the set-theoretic translation method for polymodal logic introduced in 11] to extended modal logics. Instead of devising an ad-hoc translation for each logic, we develop a general framework within which a number of extended modal logics can be dealt with. We rst extend the basic set-theoretic translation method to weak monadic second-order logic through a suitable c...
متن کاملModal Logic, Autumn 2007 FIrst Steps in Modal Logic
Modal logic is sometimes characterized as the logic of necessity and possibility, of “must be” and “may be”. The aim of this book is to present both semantical and syntactical features of the subject and to illustrate gy detailed analysis of the three most popular modal systems S5,S4 and K. The text presupposes some knowledge of classical logic, although the necessary information is briefly rec...
متن کاملModal Tableaux with Propagation Rules and Structural Rules
In this paper we generalize the existing tableau methods for modal logics. First of all, while usual modal tableaux are based on trees, our basic structures are rooted directed acyclic graphs (RDAG). This allows natural tableau rules for some modal logics that are diicult to capture in the usual way (such as those having an accessibility relation that is dense or connuent). Second, tableau rule...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2015
ISSN: 0168-0072
DOI: 10.1016/j.apal.2015.04.004